منابع مشابه
Lifting Redundancy from Latin Squares to Pandiagonal Latin Squares
In the pandiagonal Latin Square problem, a square grid of size N needs to be filled with N types of objects, so that each column, row, and wrapped around diagonal (both up and down) contains an object of each type. This problem dates back to at least Euler. In its specification as a constraint satisfaction problem, one uses the all different constraint. The known redundancy result about all dif...
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملAmalgamating infinite latin squares
A finite latin square is an n × n matrix whose entries are elements of the set {1, . . . , n} and no element is repeated in any row or column. Given equivalence relations on the set of rows, the set of columns, and the set of symbols, respectively, we can use these relations to identify equivalent rows, columns and symbols, and obtain an amalgamated latin square. There is a set of natural equat...
متن کاملNearly Orthogonal Latin Squares
A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2011
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.11.011